Lower bound for the Perron–Frobenius degrees of Perron numbers
نویسندگان
چکیده
منابع مشابه
Linear Lower Bound on Degrees
It is established a linear (thereby, sharp) lower bound on degrees of Positivstellensatz calculus refutations over a real eld introduced in GV99], for the Tseitin tautologies and for the parity (the mod 2 principle). We use the machinery of the Laurent proofs developped for binomial systems in BuGI 98], BuGI 99].
متن کاملAn Improved Lower Bound for Crossing Numbers
The crossing number of a graph G = (V,E), denoted by cr(G), is the smallest number of edge crossings in any drawing of G in the plane. Leighton [14] proved that for any n-vertex graph G of bounded degree, its crossing number satisfies cr(G) + n = Ω(bw(G)), where bw(G) is the bisection width of G. The lower bound method was extended for graphs of arbitrary vertex degrees to cr(G)+ 1 16 ∑ v∈G d 2...
متن کاملThe smallest Perron numbers
A Perron number is a real algebraic integer α of degree d ≥ 2, whose conjugates are αi, such that α > max2≤i≤d |αi|. In this paper we compute the smallest Perron numbers of degree d ≤ 24 and verify that they all satisfy the Lind-Boyd conjecture. Moreover, the smallest Perron numbers of degree 17 and 23 give the smallest house for these degrees. The computations use a family of explicit auxiliar...
متن کاملA Lower Bound for Schur Numbers and Multicolor Ramsey Numbers
For k ≥ 5, we establish new lower bounds on the Schur numbers S(k) and on the k-color Ramsey numbers of K3. For integers m and n, let [m,n] denote the set {i |m ≤ i ≤ n}. A set S of integers is called sum-free if i, j ∈ S implies i + j 6∈ S, where we allow i = j. The Schur function S(k) is defined for all positive integers as the maximum n such that [1, n] can be partitioned into k sum-free set...
متن کاملA Lower Bound for the Translative Kissing Numbers of Simplices
First we recall some standard definitions. By a d-dimensional convex body we mean a compact convex subset of Rd with non-empty interior. Two subsets of Rd with non-empty interiors are non-overlapping if they have no common interior point, and we say that they touch each other if they are non-overlapping and their intersection is non-empty. Denote by H(K) the translative kissing number of a d-di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ergodic Theory and Dynamical Systems
سال: 2020
ISSN: 0143-3857,1469-4417
DOI: 10.1017/etds.2019.113